Utilizing the Genetic Algorithm to Pruning the C4.5 Decision Tree Algorithm

نویسندگان

چکیده

A decision tree (DTs) is one of the most popular machine learning algorithms that divide data repeatedly to form groups or classes. It a supervised algorithm can be used on discrete continuous for classification regression. The traditional classifier in this C4.5 tree, which point research. This has advantage building vast set and does not stop until it reaches desired goal. problem with there are unnecessary nodes branches leading overfitting. overfitting negatively affect process. In context, authors suggest utilizing genetic prune effect dataset study consists four datasets: IRIS, Car Evaluation, GLASS, WINE collected from UC Irvine (UCI) repository. experimental results have confirmed effectiveness pruning datasets optimizing confidence factor (CF) tree. proposed method reached about 92% accuracy work.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

15 صفحه اول

Experiments with an innovative tree pruning algorithm

The pruning phase is one of the necessary steps in decision tree induction. Existing pruning algorithms tend to have some or all of the following difficulties: 1) lack of theoretical support; 2) high computational complexity; 3) dependence on validation; 4) complicated implementation. The 2-norm pruning algorithm proposed here addresses all of the above difficulties. This paper demonstrates the...

متن کامل

FBP: A Frontier-Based Tree-Pruning Algorithm

A frontier-based tree-pruning algorithm (FBP) is proposed. The new method has comparable order of computational complexity, comparing with Cost-Complexity Pruning (CCP). Regarding tree pruning, it provides a full spectrum of information; specifically, (1) given the value of the penalization parameter λ, it gives the minimum size of a decision tree; (2) given the size of a decision tree, it prov...

متن کامل

The Alternating Decision Tree Learning Algorithm

The application of boosting procedures to de cision tree algorithms has been shown to pro duce very accurate classi ers These classi ers are in the form of a majority vote over a number of decision trees Unfortunately these classi ers are often large complex and di cult to interpret This paper describes a new type of classi cation rule the alternat ing decision tree which is a generalization of...

متن کامل

A hybrid decision tree/genetic algorithm method for data mining

This paper addresses the well-known classification task of data mining, where the objective is to predict the class which an example belongs to. Discovered knowledge is expressed in the form of high-level, easy-to-interpret classification rules. In order to discover classification rules, we propose a hybrid decision tree/genetic algorithm method. The central idea of this hybrid method involves ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Asian Journal of Applied Sciences

سال: 2021

ISSN: ['1996-3343']

DOI: https://doi.org/10.24203/ajas.v9i1.6503